منابع مشابه
Stochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملLarge Deviations Bounds for a Polling System with Markovian On/off Sources and Bernoulli Service Schedule
In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedul...
متن کاملThe Upper Bounds for Performance Measures of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds f...
متن کاملstochastic bounds for a single server queue with general retrial times
we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds. the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques.
متن کاملStochastic Petri Net Models of Polling Systems
We consider finite-population and finite-capacity polling systems. The behavior of these systems is described by means of generalized stochastic Petri nets. The exact results for the mean response times are obtained numerically by means of the stochastic Petri net package. Finite population polling systems are generally difficult to analyze. Thus, one of the contributions of this paper is the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1994
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02024662